Traffic assignment problem for a general network

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Different Network Performance Measures in a Multi-Objective Traffic Assignment Problem

Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...

متن کامل

A New Model for Fleet Assignment Problem, Case Study of Iran Air Network at Vision 2036

The fleet assignment problem (FAP) assigns the type of airplane at each flight segment. Since airplane is an expensive resource, poor fleet assignment can cause a great increase in costs of airlines. There are so many consideration which should be tackled in formulation of a FAP problem, especially the parameters regarding to the airplanes. This paper presents a novel, mixed integer programing ...

متن کامل

Complete / Incomplete Hierarchical Hub Center Single Assignment Network Problem

In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs.  The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...

متن کامل

A Partial Linearization Method for the Traffic Assignment Problem

This paper presents a new solution technique for the traffic assignment problem. The approach is based on an iteratively improved nonlinear and separable approximation of the originally nonseparable objective function, and resembles the Frank-Wolfe algorithm in the sense that the subproblem separates with respect to commodities. Since the singlecommodity subproblems are strictly convex, the new...

متن کامل

A Mean-Risk Model for the Stochastic Traffic Assignment Problem

Heavy and uncertain traffic conditions exacerbate the commuting experience of millions of people across the globe. When planning important trips, commuters typically add an extra buffer to the expected trip duration to ensure on-time arrival. Motivated by this, we propose a new traffic assignment model that takes into account the stochastic nature of travel times. Our model extends the traditio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences

سال: 1969

ISSN: 0098-8979

DOI: 10.6028/jres.073b.010